0.02/0.08	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.02/0.08	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.07/0.28	% Computer   : n021.cluster.edu
0.07/0.28	% Model      : x86_64 x86_64
0.07/0.28	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.07/0.28	% Memory     : 8042.1875MB
0.07/0.28	% OS         : Linux 3.10.0-693.el7.x86_64
0.07/0.28	% CPULimit   : 1200
0.07/0.28	% WCLimit    : 120
0.07/0.28	% DateTime   : Tue Jul 13 13:22:55 EDT 2021
0.07/0.29	% CPUTime    : 
0.07/0.29	% Number of cores: 8
0.07/0.29	% Python version: Python 3.6.8
0.07/0.29	# Version: 2.6rc1-ho
0.07/0.29	# No SInE strategy applied
0.07/0.29	# Trying AutoSched0 for 59 seconds
59.11/59.56	# AutoSched0-Mode selected heuristic G_E___208_C18AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
59.11/59.56	# and selection function SelectComplexExceptUniqMaxHorn.
59.11/59.56	#
59.11/59.56	# Preprocessing time       : 0.029 s
59.11/59.56	# Presaturation interreduction done
59.21/59.69	# No success with AutoSched0
59.21/59.69	# Trying AutoSched1 for 26 seconds
85.23/85.71	# AutoSched1-Mode selected heuristic G_E___301_C18_F1_URBAN_S5PRR_S0Y
85.23/85.71	# and selection function SelectMaxLComplexAvoidPosPred.
85.23/85.71	#
85.23/85.71	# Preprocessing time       : 0.031 s
85.27/85.78	# No success with AutoSched1
85.27/85.78	# Trying AutoSched2 for 8 seconds
93.29/93.80	# AutoSched2-Mode selected heuristic G_E___303_C18_F1_URBAN_S0Y
93.29/93.80	# and selection function SelectMaxLComplexAvoidPosPred.
93.29/93.80	#
93.29/93.80	# Preprocessing time       : 0.030 s
93.29/93.83	# No success with AutoSched2
93.29/93.83	# Trying AutoSched3 for 7 seconds
100.29/100.83	# AutoSched3-Mode selected heuristic G_E___042_C45_F1_PI_AE_Q4_CS_SP_PS_S4S
100.29/100.83	# and selection function SelectNewComplexAHPNS.
100.29/100.83	#
100.29/100.83	# Preprocessing time       : 0.013 s
100.29/100.83	# Presaturation interreduction done
100.29/100.84	# No success with AutoSched3
100.29/100.84	# Trying AutoSched4 for 5 seconds
100.36/100.97	# AutoSched4-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S06EI
100.36/100.97	# and selection function PSelectNewComplexAHPExceptUniqMaxHorn.
100.36/100.97	#
100.36/100.97	# Preprocessing time       : 0.012 s
100.36/100.97	# Presaturation interreduction done
100.36/100.97	
100.36/100.97	# Proof found!
100.36/100.97	# SZS status Theorem
100.36/100.97	# SZS output start CNFRefutation
100.36/100.97	thf(breln1, axiom, (breln1)=(^[X1:$i, X9:$i]:subset @ X9 @ (cartprod @ X1 @ X1)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', breln1)).
100.36/100.97	thf(breln, axiom, (breln)=(^[X1:$i, X2:$i, X3:$i]:subset @ X3 @ (cartprod @ X1 @ X2)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', breln)).
100.36/100.97	thf(breln1compI, conjecture, (dpsetconstrI=>![X1:$i, X9:$i]:(![X10:$i]:(breln1 @ X1 @ X10=>![X5:$i]:(![X6:$i]:(![X7:$i]:(((in @ (kpair @ X7 @ X6) @ X10=>in @ (kpair @ X5 @ X6) @ (breln1compset @ X1 @ X9 @ X10))<=in @ (kpair @ X5 @ X7) @ X9)<=in @ X7 @ X1)<=in @ X6 @ X1)<=in @ X5 @ X1))<=breln1 @ X1 @ X9)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', breln1compI)).
100.36/100.97	thf(dpsetconstrI, axiom, (dpsetconstrI<=>![X1:$i, X2:$i, X4:$i > $i > $o, X5:$i]:(in @ X5 @ X1=>![X6:$i]:(in @ X6 @ X2=>(X4 @ X5 @ X6=>in @ (kpair @ X5 @ X6) @ (dpsetconstr @ X1 @ X2 @ (^[X7:$i, X8:$i]:X4 @ X7 @ X8)))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', dpsetconstrI)).
100.36/100.97	thf(breln1compset, axiom, (breln1compset)=(^[X1:$i, X9:$i, X10:$i]:dpsetconstr @ X1 @ X1 @ (^[X5:$i, X6:$i]:?[X7:$i]:((in @ X7 @ X1&in @ (kpair @ X5 @ X7) @ X9)&in @ (kpair @ X7 @ X6) @ X10))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', breln1compset)).
100.36/100.97	thf(c_0_5, axiom, (breln1)=(^[X1:$i, X9:$i]:subset @ X9 @ (cartprod @ X1 @ X1)), inference(apply_def,[status(thm)],[breln1, breln])).
100.36/100.97	thf(c_0_6, plain, ![X8:$i, X7:$i, X4:$i > $i > $o]:(epred2_3 @ X4 @ X7 @ X8<=>X4 @ X7 @ X8), introduced(definition)).
100.36/100.97	thf(c_0_7, plain, ![X23:$i, X22:$i, X1:$i, X9:$i, X10:$i]:(epred1_5 @ X10 @ X9 @ X1 @ X22 @ X23<=>?[X24:$i]:((in @ X24 @ X1&in @ (kpair @ X22 @ X24) @ X9)&in @ (kpair @ X24 @ X23) @ X10)), introduced(definition)).
100.36/100.97	thf(c_0_8, negated_conjecture, ~((![X1:$i, X2:$i, X4:$i > $i > $o, X5:$i]:(in @ X5 @ X1=>![X6:$i]:(in @ X6 @ X2=>(X4 @ X5 @ X6=>in @ (kpair @ X5 @ X6) @ (dpsetconstr @ X1 @ X2 @ (epred2_3 @ X4)))))=>![X1:$i, X9:$i]:(subset @ X9 @ (cartprod @ X1 @ X1)=>![X10:$i]:(subset @ X10 @ (cartprod @ X1 @ X1)=>![X5:$i]:(in @ X5 @ X1=>![X6:$i]:(in @ X6 @ X1=>![X7:$i]:(in @ X7 @ X1=>(in @ (kpair @ X5 @ X7) @ X9=>(in @ (kpair @ X7 @ X6) @ X10=>in @ (kpair @ X5 @ X6) @ (breln1compset @ X1 @ X9 @ X10)))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[breln1compI]), dpsetconstrI]), c_0_5]), c_0_6])])).
100.36/100.97	thf(c_0_9, plain, ![X1:$i, X9:$i, X10:$i]:(breln1compset @ X1 @ X9 @ X10)=(dpsetconstr @ X1 @ X1 @ (epred1_5 @ X10 @ X9 @ X1)), inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[breln1compset]), c_0_7])).
100.36/100.97	thf(c_0_10, negated_conjecture, ![X28:$i, X29:$i, X30:$i > $i > $o, X31:$i, X32:$i]:((~in @ X31 @ X28|(~in @ X32 @ X29|(~X30 @ X31 @ X32|in @ (kpair @ X31 @ X32) @ (dpsetconstr @ X28 @ X29 @ (epred2_3 @ X30)))))&(subset @ esk2_0 @ (cartprod @ esk1_0 @ esk1_0)&(subset @ esk3_0 @ (cartprod @ esk1_0 @ esk1_0)&(in @ esk4_0 @ esk1_0&(in @ esk5_0 @ esk1_0&(in @ esk6_0 @ esk1_0&(in @ (kpair @ esk4_0 @ esk6_0) @ esk2_0&(in @ (kpair @ esk6_0 @ esk5_0) @ esk3_0&~in @ (kpair @ esk4_0 @ esk5_0) @ (breln1compset @ esk1_0 @ esk2_0 @ esk3_0))))))))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])).
100.36/100.97	thf(c_0_11, plain, ![X25:$i, X26:$i, X27:$i]:(breln1compset @ X25 @ X26 @ X27)=(dpsetconstr @ X25 @ X25 @ (epred1_5 @ X27 @ X26 @ X25)), inference(variable_rename,[status(thm)],[c_0_9])).
100.36/100.97	thf(c_0_12, negated_conjecture, ![X2:$i, X1:$i, X5:$i, X4:$i > $i > $o, X3:$i]:(in @ (kpair @ X1 @ X3) @ (dpsetconstr @ X2 @ X5 @ (epred2_3 @ X4))|~in @ X1 @ X2|~in @ X3 @ X5|~X4 @ X1 @ X3), inference(split_conjunct,[status(thm)],[c_0_10])).
100.36/100.97	thf(c_0_13, plain, ![X3:$i, X2:$i, X1:$i]:(breln1compset @ X1 @ X2 @ X3)=(dpsetconstr @ X1 @ X1 @ (epred1_5 @ X3 @ X2 @ X1)), inference(split_conjunct,[status(thm)],[c_0_11])).
100.36/100.97	thf(c_0_14, plain, ![X39:$i, X40:$i, X41:$i, X42:$i, X43:$i, X45:$i, X46:$i, X47:$i, X48:$i, X49:$i, X50:$i]:((((in @ (esk7_5 @ X39 @ X40 @ X41 @ X42 @ X43) @ X41|~epred1_5 @ X43 @ X42 @ X41 @ X40 @ X39)&(in @ (kpair @ X40 @ (esk7_5 @ X39 @ X40 @ X41 @ X42 @ X43)) @ X42|~epred1_5 @ X43 @ X42 @ X41 @ X40 @ X39))&(in @ (kpair @ (esk7_5 @ X39 @ X40 @ X41 @ X42 @ X43) @ X39) @ X43|~epred1_5 @ X43 @ X42 @ X41 @ X40 @ X39))&(~in @ X50 @ X47|~in @ (kpair @ X46 @ X50) @ X48|~in @ (kpair @ X50 @ X45) @ X49|epred1_5 @ X49 @ X48 @ X47 @ X46 @ X45)), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])])])])).
100.36/100.97	thf(c_0_15, plain, ![X1:$i, X6:$i, X5:$i, X4:$i > $i > $o, X3:$i, X2:$i]:(in @ (kpair @ X1 @ X2) @ (breln1compset @ X3 @ X5 @ X6)|(epred1_5 @ X6 @ X5 @ X3)!=(epred2_3 @ X4)|~in @ X2 @ X3|~in @ X1 @ X3|~X4 @ X1 @ X2), inference(er,[status(thm)],[inference(er,[status(thm)],[inference(ext_sup,[status(thm)],[c_0_12, c_0_13])])])).
100.36/100.97	thf(c_0_16, plain, ![X1:$i, X3:$i, X5:$i, X2:$i, X6:$i, X7:$i]:(epred1_5 @ X7 @ X5 @ X2 @ X3 @ X6|~in @ X1 @ X2|~in @ (kpair @ X3 @ X1) @ X5|~in @ (kpair @ X1 @ X6) @ X7), inference(split_conjunct,[status(thm)],[c_0_14])).
100.36/100.97	thf(c_0_17, plain, ![X1:$i, X2:$i, X5:$i, X3:$i, X7:$i, X6:$i, X8:$i, X10:$i, X9:$i]:(in @ (kpair @ X1 @ X2) @ (breln1compset @ X3 @ X5 @ X6)|(epred1_5 @ X6 @ X5 @ X3)!=(epred2_3 @ (epred1_5 @ X7 @ X8 @ X9))|~in @ (kpair @ X1 @ X10) @ X8|~in @ (kpair @ X10 @ X2) @ X7|~in @ X2 @ X3|~in @ X1 @ X3|~in @ X10 @ X9), inference(spm,[status(thm)],[c_0_15, c_0_16])).
100.36/100.97	thf(c_0_18, negated_conjecture, in @ (kpair @ esk4_0 @ esk6_0) @ esk2_0, inference(split_conjunct,[status(thm)],[c_0_10])).
100.36/100.97	thf(c_0_19, negated_conjecture, ![X1:$i, X5:$i, X3:$i, X7:$i, X6:$i, X2:$i]:(in @ (kpair @ esk4_0 @ X1) @ (breln1compset @ X2 @ X3 @ X5)|(epred1_5 @ X5 @ X3 @ X2)!=(epred2_3 @ (epred1_5 @ X6 @ esk2_0 @ X7))|~in @ (kpair @ esk6_0 @ X1) @ X6|~in @ esk4_0 @ X2|~in @ esk6_0 @ X7|~in @ X1 @ X2), inference(spm,[status(thm)],[c_0_17, c_0_18])).
100.36/100.97	thf(c_0_20, negated_conjecture, in @ esk4_0 @ esk1_0, inference(split_conjunct,[status(thm)],[c_0_10])).
100.36/100.97	thf(c_0_21, negated_conjecture, ![X3:$i, X2:$i, X6:$i, X5:$i, X1:$i]:(in @ (kpair @ esk4_0 @ X1) @ (breln1compset @ esk1_0 @ X2 @ X3)|(epred1_5 @ X3 @ X2 @ esk1_0)!=(epred2_3 @ (epred1_5 @ X5 @ esk2_0 @ X6))|~in @ (kpair @ esk6_0 @ X1) @ X5|~in @ esk6_0 @ X6|~in @ X1 @ esk1_0), inference(spm,[status(thm)],[c_0_19, c_0_20])).
100.36/100.97	thf(c_0_22, negated_conjecture, in @ esk6_0 @ esk1_0, inference(split_conjunct,[status(thm)],[c_0_10])).
100.36/100.97	thf(c_0_23, negated_conjecture, ![X2:$i, X5:$i, X3:$i, X1:$i]:(in @ (kpair @ esk4_0 @ X1) @ (breln1compset @ esk1_0 @ X2 @ X3)|(epred1_5 @ X3 @ X2 @ esk1_0)!=(epred2_3 @ (epred1_5 @ X5 @ esk2_0 @ esk1_0))|~in @ (kpair @ esk6_0 @ X1) @ X5|~in @ X1 @ esk1_0), inference(spm,[status(thm)],[c_0_21, c_0_22])).
100.36/100.97	thf(c_0_24, negated_conjecture, in @ esk5_0 @ esk1_0, inference(split_conjunct,[status(thm)],[c_0_10])).
100.36/100.97	thf(c_0_25, negated_conjecture, ![X1:$i, X2:$i, X3:$i]:(in @ (kpair @ esk4_0 @ esk5_0) @ (breln1compset @ esk1_0 @ X1 @ X2)|(epred1_5 @ X2 @ X1 @ esk1_0)!=(epred2_3 @ (epred1_5 @ X3 @ esk2_0 @ esk1_0))|~in @ (kpair @ esk6_0 @ esk5_0) @ X3), inference(spm,[status(thm)],[c_0_23, c_0_24])).
100.36/100.97	thf(c_0_26, negated_conjecture, in @ (kpair @ esk6_0 @ esk5_0) @ esk3_0, inference(split_conjunct,[status(thm)],[c_0_10])).
100.36/100.97	thf(c_0_27, negated_conjecture, ~in @ (kpair @ esk4_0 @ esk5_0) @ (breln1compset @ esk1_0 @ esk2_0 @ esk3_0), inference(split_conjunct,[status(thm)],[c_0_10])).
100.36/100.97	thf(c_0_28, negated_conjecture, ![X2:$i, X1:$i]:(in @ (kpair @ esk4_0 @ esk5_0) @ (breln1compset @ esk1_0 @ X1 @ X2)|(epred1_5 @ X2 @ X1 @ esk1_0)!=(epred2_3 @ (epred1_5 @ esk3_0 @ esk2_0 @ esk1_0))), inference(spm,[status(thm)],[c_0_25, c_0_26])).
100.36/100.97	thf(c_0_29, negated_conjecture, (epred2_3 @ (epred1_5 @ esk3_0 @ esk2_0 @ esk1_0))!=(epred1_5 @ esk3_0 @ esk2_0 @ esk1_0), inference(spm,[status(thm)],[c_0_27, c_0_28])).
100.36/100.97	thf(c_0_30, plain, ![X51:$i, X52:$i, X53:$i > $i > $o]:((~epred2_3 @ X53 @ X52 @ X51|X53 @ X52 @ X51)&(~X53 @ X52 @ X51|epred2_3 @ X53 @ X52 @ X51)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])).
100.36/100.97	thf(c_0_31, negated_conjecture, (epred2_3 @ (epred1_5 @ esk3_0 @ esk2_0 @ esk1_0) @ esk246_0 @ esk247_0)!=(epred1_5 @ esk3_0 @ esk2_0 @ esk1_0 @ esk246_0 @ esk247_0), inference(neg_ext,[status(thm)],[c_0_29])).
100.36/100.97	thf(c_0_32, plain, ![X1:$i, X4:$i > $i > $o, X2:$i]:(epred2_3 @ X4 @ X1 @ X2|~X4 @ X1 @ X2), inference(split_conjunct,[status(thm)],[c_0_30])).
100.36/100.97	thf(c_0_33, negated_conjecture, epred2_3 @ (epred1_5 @ esk3_0 @ esk2_0 @ esk1_0) @ esk246_0 @ esk247_0, inference(csr,[status(thm)],[inference(dynamic cnf,[status(thm)],[c_0_31]), c_0_32])).
100.36/100.97	thf(c_0_34, plain, ![X1:$i, X4:$i > $i > $o, X2:$i]:(X4 @ X1 @ X2|~epred2_3 @ X4 @ X1 @ X2), inference(split_conjunct,[status(thm)],[c_0_30])).
100.36/100.97	thf(c_0_35, negated_conjecture, ~epred1_5 @ esk3_0 @ esk2_0 @ esk1_0 @ esk246_0 @ esk247_0, inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(dynamic cnf,[status(thm)],[c_0_31]), c_0_33])])).
100.36/100.97	thf(c_0_36, plain, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34, c_0_33]), c_0_35]), ['proof']).
100.36/100.97	# SZS output end CNFRefutation
100.36/100.97	# Proof object total steps             : 37
100.36/100.97	# Proof object clause steps            : 23
100.36/100.97	# Proof object formula steps           : 14
100.36/100.97	# Proof object conjectures             : 19
100.36/100.97	# Proof object clause conjectures      : 16
100.36/100.97	# Proof object formula conjectures     : 3
100.36/100.97	# Proof object initial clauses used    : 11
100.36/100.97	# Proof object initial formulas used   : 5
100.36/100.97	# Proof object generating inferences   : 8
100.36/100.97	# Proof object simplifying inferences  : 6
100.36/100.97	# Training examples: 0 positive, 0 negative
100.36/100.97	# Parsed axioms                        : 14
100.36/100.97	# Removed by relevancy pruning/SinE    : 0
100.36/100.97	# Initial clauses                      : 25
100.36/100.97	# Removed in clause preprocessing      : 9
100.36/100.97	# Initial clauses in saturation        : 16
100.36/100.97	# Processed clauses                    : 342
100.36/100.97	# ...of these trivial                  : 0
100.36/100.97	# ...subsumed                          : 16
100.36/100.97	# ...remaining for further processing  : 325
100.36/100.97	# Other redundant clauses eliminated   : 110
100.36/100.97	# Clauses deleted for lack of memory   : 0
100.36/100.97	# Backward-subsumed                    : 0
100.36/100.97	# Backward-rewritten                   : 0
100.36/100.97	# Generated clauses                    : 13555
100.36/100.97	# ...of the previous two non-trivial   : 11436
100.36/100.97	# Contextual simplify-reflections      : 1
100.36/100.97	# Paramodulations                      : 11115
100.36/100.97	# Factorizations                       : 0
100.36/100.97	# NegExts                              : 243
100.36/100.97	# Equation resolutions                 : 110
100.36/100.97	# Propositional unsat checks           : 0
100.36/100.97	#    Propositional check models        : 0
100.36/100.97	#    Propositional check unsatisfiable : 0
100.36/100.97	#    Propositional clauses             : 0
100.36/100.97	#    Propositional clauses after purity: 0
100.36/100.97	#    Propositional unsat core size     : 0
100.36/100.97	#    Propositional preprocessing time  : 0.000
100.36/100.97	#    Propositional encoding time       : 0.000
100.36/100.97	#    Propositional solver time         : 0.000
100.36/100.97	#    Success case prop preproc time    : 0.000
100.36/100.97	#    Success case prop encoding time   : 0.000
100.36/100.97	#    Success case prop solver time     : 0.000
100.36/100.97	# Current number of processed clauses  : 297
100.36/100.97	#    Positive orientable unit clauses  : 9
100.36/100.97	#    Positive unorientable unit clauses: 0
100.36/100.97	#    Negative unit clauses             : 4
100.36/100.97	#    Non-unit-clauses                  : 284
100.36/100.97	# Current number of unprocessed clauses: 11126
100.36/100.97	# ...number of literals in the above   : 70329
100.36/100.97	# Current number of archived formulas  : 0
100.36/100.97	# Current number of archived clauses   : 28
100.36/100.97	# Clause-clause subsumption calls (NU) : 11788
100.36/100.97	# Rec. Clause-clause subsumption calls : 2894
100.36/100.97	# Non-unit clause-clause subsumptions  : 17
100.36/100.97	# Unit Clause-clause subsumption calls : 58
100.36/100.97	# Rewrite failures with RHS unbound    : 0
100.36/100.97	# BW rewrite match attempts            : 0
100.36/100.97	# BW rewrite match successes           : 0
100.36/100.97	# Condensation attempts                : 0
100.36/100.97	# Condensation successes               : 0
100.36/100.97	# Termbank termtop insertions          : 474456
100.36/100.97	
100.36/100.97	# -------------------------------------------------
100.36/100.97	# User time                : 98.651 s
100.36/100.97	# System time              : 1.726 s
100.36/100.97	# Total time               : 100.377 s
100.36/100.97	# Maximum resident set size: 1660 pages
100.48/100.97	EOF